Existence and computation of optimal tolls in multiclass network equilibrium problems
نویسندگان
چکیده
In this workwe provide a simple proof of the existence of optimal tolls formulticlass network equilibrium problems where the value-of-time parameter varies continuously throughout the population. The main argument, based on a finite-dimensional reformulation of the problem, also allows us to determine in a simple fashion revenue minimizing link toll vectors. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
Application of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems
The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...
متن کاملComputing Tolls and Checking Equilibrium for Traac Flows
We consider the problems of computing tolls and checking for equilibrium of ows in a traac network in which travelers act according to Wardrop's user-equilibrium principle. We provide an algorithm which, given any feasible distribution of traac ows, and the corresponding link traversal times, will either (i) determine that the given ows and travel times satisfy Wardrop's user-equilibrium princi...
متن کاملWhen are Marginal Congestion Tolls Optimal?
Marginal tolls are known to provide the existence of an optimal equilibrium in atomic congestion games, but unlike nonatomic games, there might be additional equilibria even with linear cost functions on resources. In this paper, we show that in games with a large number of players, all equilibria are near-optimal.
متن کاملDemand-Independent Optimal Tolls
Wardrop equilibria in nonatomic congestion games are in general inefficient as they do not induce an optimal flow that minimizes the total travel time. Network tolls are a prominent and popular way to induce an optimum flow in equilibrium. The classical approach to find such tolls is marginal cost pricing which requires the exact knowledge of the demand on the network. In this paper, we investi...
متن کاملComputing Optimal Tolls with Arc Restrictions and Heterogeneous Players
The problem of computing optimal network tolls that induce a Nash equilibrium of minimum total cost has been studied intensively in the literature, but mostly under the assumption that these tolls are unrestricted. Here we consider this problem under the more realistic assumption that the tolls have to respect some given upper bound restrictions on the arcs. The problem of taxing subnetworks op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 37 شماره
صفحات -
تاریخ انتشار 2009